Перевод: со всех языков на все языки

со всех языков на все языки

finite correspondence

См. также в других словарях:

  • Finite topological space — In mathematics, a finite topological space is a topological space for which the underlying point set is finite. That is, it is a topological space for which there are only finitely many points.While topology is mostly interesting only for… …   Wikipedia

  • Finite difference — A finite difference is a mathematical expression of the form f(x + b) − f(x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences… …   Wikipedia

  • Finite set — In mathematics, a set is called finite if there is a bijection between the set and some set of the form {1, 2, ..., n} where n is a natural number. (The value n = 0 is allowed; that is, the empty set is finite.) An infinite set is a set which is… …   Wikipedia

  • Correspondence (mathematics) — In mathematics and mathematical economics, correspondence is a term with several related but not identical meanings. In general mathematics, correspondence is an alternative term for a relation between two sets. Hence a correspondence of sets X… …   Wikipedia

  • finite set — Intuitively, a set whose count stops somewhere. Formally, a set whose members can be put into a one to one correspondence with the members of the set of all natural numbers less than some given number …   Philosophy dictionary

  • Post correspondence problem — The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946.[1] Because it is simpler than the halting problem and the Entscheidungsproblem it is often used in proofs of undecidability. Contents 1… …   Wikipedia

  • Springer correspondence — In mathematics, the Springer representations are certain representations of the Weyl group W associated to unipotent conjugacy classes of a semisimple algebraic group G . There is another parameter involved, a representation of a certain finite… …   Wikipedia

  • Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… …   Wikipedia

  • Representation theory of finite groups — In mathematics, representation theory is a technique for analyzing abstract groups in terms of groups of linear transformations. See the article on group representations for an introduction. This article discusses the representation theory of… …   Wikipedia

  • Nonstandard finite difference scheme — Nonstandard finite difference schemes is a general set of methods in numerical analysis that gives numerical solutions to differential equations by constructing a discrete model. The general rules for such schemes are not precisely known.[1] [2]… …   Wikipedia

  • mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… …   Universalium

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»